A Functional Solution to the RPC-Memory Specification Problem
نویسنده
چکیده
We give a functional speciication of the syntactic interface and the black box behavior of an unreliable and a reliable memory component and a remote procedure (RPC) call component. The RPC component controls the access to the memory. In addition, we specify a clerk for driving the RPC component. The used method is modular and therefore it allows us to specify each of these components independently and separately. We discuss the speciications shortly and then compose them into a distributed system of interacting components. We prove that the speciication of the composed system fulllls again the requirement spec-iication of the unreliable memory component. Finally we give a timed version of the RPC component and of a clerk component and compose them.
منابع مشابه
A TLA Solution to the RPC-Memory Specification Problem
We present a complete solution to the Broy Lamport speci cation problem Our speci cations are written in TLA a formal lan guage based on TLA We give the high levels of structured proofs and sketch the lower levels which will appear in full elsewhere
متن کاملTackling the RPC-Memory Specification Problem with I/O Automata
An I/O automata solution to the problem posed in 1994 by Broy & Lamport at the Dagstuhl Workshop on Reactive Systems is presented. The problem calls for speciication and veriication of memory and remote procedure call components. The problem speciication consists of an untimed and a timed part. In this paper, both parts are solved completely.
متن کاملA Functional Solution to the RPC Memory Speci cation Problem
We give a functional speci cation of the syntactic interface and the black box behavior of an unreliable and a reliable memory com ponent and a remote procedure RPC call component The RPC com ponent controls the access to the memory In addition we specify a clerk for driving the RPC component The used method is modular and there fore it allows us to specify each of these components independentl...
متن کاملA Memory Module Specification Using Composable High-Level Petri Nets
This paper describes a solution of the RPC-memory speci-cation problem deened by M. Broy and L. Lamport on the occasion of a Dagstuhl seminar in 1994. The approach is based on a recently developed model of composable high-level Petri nets called M-nets, on which CCS-like composition operations such as parallel composition, restriction and transition synchronisation are deened. Correctness proof...
متن کاملUsing PVS for an Assertional Verification of the RPC-Memory Specification Problem
The RPC-Memory Speciication Problem has been speciied and veriied in an assertional method, supported by the veriication system PVS. Properties of the components are expressed in the higher-order logic of PVS and all implementations have been veriied by means of the interactive proof checker of PVS. A simpliication of the memory speciication-allowing multiple atomic reads-has been proved correc...
متن کامل